On Finding Separators in Temporal Split and Permutation Graphs
نویسندگان
چکیده
Disconnecting two vertices s and z in a graph by removing minimum number of is fundamental problem algorithmic theory. This (s, z)-Separation well-known to be polynomial solvable serves as an important primitive many applications related network connectivity.
منابع مشابه
The Computational Complexity of Finding Separators in Temporal Graphs
Vertex separators, that is, vertex sets whose deletion disconnects two distinguished vertices ina graph, play a pivotal role in algorithmic graph theory. For instance, the concept of tree decom-positions of graphs is tightly connected to the separator concept. For many realistic models of thereal world, however, it is necessary to consider graphs whose edge set changes with time...
متن کاملFinding Shortest Maximal Increasing Subsequences and Domination in Permutation Graphs
In this paper we present an algorithm with O(n log2n) complexity to find a shortest maximal increasing subsequence of a sequence of numbers. As a byproduct of this algorithm a O(n log2n) algorithm to find a minimum (weight) independent dominating set in permutation graphs is obtained, this compares favorable with the previous O(n3) algorithms known to solve
متن کاملString graphs and separators
String graphs, that is, intersection graphs of curves in the plane, have been studied since the 1960s. We provide an expository presentation of several results, including very recent ones: some string graphs require an exponential number of crossings in every string representation; exponential number is always sufficient; string graphs have small separators; and the current best bound on the cr...
متن کاملFinding Small Node Separators
We present a new algorithm to compute small node separators on large, undirected graphs ensuring a user defined balance on the induced connected components. Our algorithm uses edge separators computed by the open source graph partitioning package KaHIP [42] and a new technique to transform them into node separators. Given an undirected graph G, our algorithm constructs a flow problem on a subgr...
متن کاملFinding Minimal D separators
We address the problem of nding a minimal separator in a di rected acyclic graph DAG namely nding a set Z of nodes that d separates a given pair of nodes such that no proper subset of Z d separates that pair We analyze several versions of this problem and o er polynomial algorithms for each These include nding a minimal separator from a restricted set of nodes nding a minimum cost separator and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86593-1_27